Optimizing algebraic connectivity by edge rewiring
نویسندگان
چکیده
Robustness in complex networks is an ongoing research effort that seeks to improve the connectivity of networks against attacks and failures. Among other measures, algebraic connectivity has been used to characterize processes such as damped oscillation of liquids in connected pipes. Similar characterizations include the number of edges necessary to disconnect a network: the larger the algebraic connectivity, the larger the number of edges required to disconnect a network and hence, the more robust a network. In this paper, we answer the question, ''Which edge can we rewire to have the largest increase in algebraic connectivity?''. Furthermore, we extend the rewiring of a single edge to rewiring multiple edges to realize the maximal increase in algebraic connectivity. The answer to this question above can provide insights to decision makers within various domains such as communication and transportation networks, who seek an efficient solution to optimize the connectivity and thus increase the robustness of their networks. Most importantly, our analytical and numerical results not only provide insights to the number of edges to rewire, but also the location in the network where these edges would effectuate the maximal increase in algebraic connectivity and therefore, enable a maximal increase in robustness. Complex networks including biological, power grid, Internet, and transportation networks can range from hundreds to millions of vertices, and their characterization provides mechanisms to enhance their performance and realize their impact to our standard of living [1–3]. For example, the US freight network (a classic example of a transportation network), transports over $200 billion worth of products every year. The ailing transportation infrastructure is unable to sustain the economical needs of the US and a predicted increase in population (an estimated 70 million additional individuals by 2035) and trade only exacerbates the situation. To further substantiate this, in 2009 Americans spent 4.2 billion hours sitting in traffic: a cost of $115 billion dollars [4]. From a post analysis of the transportation infrastructure report for 2011, the deployment of new roadways contributes to an overall solution to alleviate traffic congestion. For this example, our results provide insights to select endpoints for roadways to increase connectivity and robustness of the transportation network. These results can apply similarly to power grid utility companies such as AEP that propose an increase of 19,000 miles to the national transmission line network, in an effort to upgrade the aging power grid infrastructure [5]. Algebraic connectivity is a …
منابع مشابه
Influence of assortativity and degree-preserving rewiring on the spectra of networks
Newman’s measure for (dis)assortativity, the linear degree correlation coefficient ρD, is reformulated in terms of the total number Nk of walks in the graph with k hops. This reformulation allows us to derive a new formula from which a degree-preserving rewiring algorithm is deduced, that, in each rewiring step, either increases or decreases ρD conform our desired objective. Spectral metrics (e...
متن کاملStress and Perception of Emotional Stimuli: Long-term Stress Rewiring the Brain
Introduction: Long-term stressful situations can drastically influence one’s mental life. However, the effect of mental stress on recognition of emotional stimuli needs to be explored. In this study, recognition of emotional stimuli in a stressful situation was investigated. Four emotional conditions, including positive and negative states in both low and high levels of arousal were analy...
متن کاملThe Rationality of Four Metrics of Network Robustness: A Viewpoint of Robust Growth of Generalized Meshes
There are quite a number of different metrics of network robustness. This paper addresses the rationality of four metrics of network robustness (the algebraic connectivity, the effective resistance, the average edge betweenness, and the efficiency) by investigating the robust growth of generalized meshes (GMs). First, a heuristic growth algorithm (the Proximity-Growth algorithm) is proposed. Th...
متن کاملNew Challenges in Cellular Automata Due to Network Geometry - Ferromagnetic Transition Study
Self-organization to ferromagnetic phase transition in cellular automata of spins governed by stochastic majority rule and when topology between spins is changed, is investigated numerically. Three types of edge rewiring are considered. The algorithm of Watts and Strogatz is applied at each time step to establish a network evolving stochastically (the first network). The preference functions ar...
متن کاملOn the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Mathematics and Computation
دوره 219 شماره
صفحات -
تاریخ انتشار 2013